A generalized and efficient algorithm for estimating transit route ODs from passenger counts

نویسندگان

  • Yuwei Li
  • Michael J. Cassidy
چکیده

An algorithm is presented for transit passenger OD estimation. The algorithm, like some other existing OD estimation techniques, generates estimates based upon passenger boarding and alighting counts at each stop along the route. The algorithm is distinct in that it does not only estimate an OD matrix for the vehicle trip from which the boarding and alighting counts were taken. Rather, it further estimates the passenger alighting probabilities at every stop on the route and these are more apt to remain fixed across transit trips. Therefore, when coupled with projected boarding counts, the alighting probabilities better characterize OD patterns on the route. These probabilities, moreover, are estimated in such way as to reflect the passengers’ latent tendencies to travel to and from ‘‘major activity centers’’ where trip-making is induced. The algorithm is therefore a more general-use method than is the estimation technique proposed by Tsygalnitsky. Since the algorithm does not require a seed matrix, and since the number of iterations required for generating estimates is specified a priori, the algorithm is easier to apply and more computationally efficient than the balancing method of OD estimation. 2006 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public Transport Ontology for Passenger Information Retrieval

Passenger information aims at improving the user-friendliness of public transport systems while influencing passenger route choices to satisfy transit user’s travel requirements. The integration of transit information from multiple agencies is a major challenge in implementation of multi-modal passenger information systems. The problem of information sharing is further compounded by the multi-l...

متن کامل

Transit Signal Priority: Proposing a Novel Algorithm to Decrease Delay and Environmental Impacts in BRT Route Intersections

Intersections are considered as the most critical parts of the bus rapid transit (BRT) system. Transit signal priority is one of the efficient solutions to reduce BRT fleet delays at intersections. The aim of this study is to propose a new algorithm to decrease the BRT fleet delays at actuated intersections, while reducing the negative impacts on different approaches. The adaptive strategy is a...

متن کامل

Application of A Route Expansion Algorithm for Transit Routes Design in Grid Networks

Establishing a network of transit routes with satisfactory demand coverage is one of the main goals of transitagencies in moving towards a sustainable urban development. A primary concern in obtaining such anetwork is reducing operational costs. This paper deals with the problem of minimizing construction costsin a grid transportation network while satisfying a certain level o...

متن کامل

Traffic equilibrium between transit lines serviced by capacitated vehicles: a route choice model with passenger waiting on platform

A theory is provided for the problem of passenger waiting and route choice at a transit station where a set of lines serviced by vehicles of limited capacity are available to reach a given destination. It is assumed that the platform layout involves one boarding zone only. The theory addresses waiting discipline – either priority queuing or mingled waiting – and choice behaviour – either selfis...

متن کامل

Comparing Fixed-Route and Demand-Responsive Feeder Transit Systems in Real-World Settings

This research presents a method of comparing fixed-route transportation systems and demand-responsive feeder transit systems using passenger survey data, published transit schedules, and optimal routing techniques. Demand-responsive transportation can be utilized to improve transit service levels in low demand areas. Since cities can vary significantly in demand across the region and time of da...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006